Ross type conjectures on monotonicity of queues

نویسندگان

  • Naoto Miyoshi
  • Tomasz Rolski
چکیده

In his seminal paper from 1978, Ross set up a few conjectures which formalize a common belief that more variable arrival processes lead to worse performance in queueing systems. We study these types of problems for Cox/GI/1/∞, Cox/GI/∞/∞, and Cox/GI/1/0 systems. Assumptions are stated in terms of ≤idcx-regularity. For example, in the class of stationary Markov processes, the regularity property holds under a doubly stochastic monotonicity assumption. A special case is a result of Daley (1968) on the decreasing covariance function for stochastically monotone stationary Markov processes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stochastic bounds for a single server queue with general retrial times

We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds‎. ‎The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques‎.

متن کامل

Inequalities for sections of exponential function series and proofs of some conjectures on monotonicity of ratios of Kummer, Gauss and generalized hypergeometric functions

In the preprint [1] one of the authors formulated some conjectures on monotonicity of ratios for exponential series sections. They lead to more general conjecture on monotonicity of ratios of Kummer hypergeometric functions and was not proved from 1993. In this paper we prove some conjectures from [1] for Kummer hypergeometric functions and its further generalizations for Gauss and generalized ...

متن کامل

A note on bounds and monotonicity of spatial stationary Cox shot noises

We consider shot-noise processes and max-shot-noise processes driven by spatial stationary Cox (doubly stochastic Poisson) processes. We derive the upper and lower bounds of them in terms of the increasing convex order, which is known as the order relation to compare the variability of random variables. Furthermore, under some regularity assumption of the random intensity fields of Cox processe...

متن کامل

Monotonicity and stability of periodic polling models

This paper deals with the stability of periodic polling models with mixed service policies. The interarrivals to all queues are independent and exponentially distributed and the service and the switch-over times are independent with general distributions. The necessary and suucient condition for the stability of such polling systems is established. The proof is based on the stochastic monotonic...

متن کامل

Polling models with renewal arrivals: A new method to derive heavy-traffic asymptotics

We consider asymmetric cyclic polling systems with an arbitrary number of queues, general service-time distributions, zero switch-over times, gated service at each queue, and with general renewal arrival processes at each of the queues. For this classical model, we propose a new method to derive closed-form expressions for the expected delay at each of the queues when the load tends to 1, under...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003